Theory and Methodology Multi-objective routing within large scale facilities using open ®nite queueing networks

نویسندگان

  • Laoucine Kerbache
  • J. MacGregor
چکیده

The major objective of this paper is to examine the optimal routing in layout and location problems from a network optimization perspective where manufacturing facilities are modelled as open ®nite queueing networks with a multiobjective set of performance measures. The overall material handling system is broken down into a set of layout topologies. For each one of these topologies the optimal routing is determined so that the product throughput is maximized while minimizing the average sojourn time and holding costs. An approximate analytical decomposition technique for modelling open ®nite queueing networks, called the Generalized Expansion Method (GEM), developed by the authors, is utilized to calculate the desired outputs. A mathematical optimization procedure which is described in this paper is then used to determine the optimal routes. As will be demonstrated, the design methodology of combining the optimization and analytical queueing network models provides a very e€ective procedure for evaluating alternative topologies while simultaneously determining the average sojourn times and the maximum throughputs of the best routes. Ó 2000 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

متن کامل

Multi-Objective Location-Routing Model With Multiple Transportation Modes For Designing Relief Networks Under Uncertainty‎

A three-level relief chain including a number of suppliers in fixed locations, candidate distribution centers and affected areas at certain points are considered. A mixed integer nonlinear programming model is proposed for open transportation location routing problem by considering split delivery of demand. To solve a realistic problem, foregoing parameters are considered as fuzzy in our propos...

متن کامل

Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)

In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...

متن کامل

An E cient and Accurate Decomposition Method for OpenFinite - and In

We address a decomposition approach for the evaluation of large, open networks of mixed nite-and innnite-buuer queues with phase-type distributed service and interarrival times. Such queueing networks can be seen as high-level speciications of continuous-time Markov chains (CTMCs). However, these CTMCs can either become very large (in case all buuers are nite) or even become innnitely large (in...

متن کامل

Deadlock properties of queueing networks with finite capacities and multiple routing chains

Blocking in queueing network models with nite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and suucient conditions for deadlock-free queueing networks with blocking are provided. An optimization algorithm is presented for nding deadlock-free capacity assignments with the least tot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999